Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem
نویسندگان
چکیده
منابع مشابه
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem
Vertex Separation Minimization Problem (VSMP) consists of finding a layout of a graph G = (V,E) which minimizes the maximum vertex cut or separation of a layout. It is an NPcomplete problem in general for which metaheuristic techniques can be applied to find near optimal solution. VSMP has applications in VLSI design, graph drawing and computer language compiler design. VSMP is polynomially sol...
متن کاملHeuristics for the Whitehead Minimization Problem
In this paper we discuss several heuristic strategies which allow one to solve the Whitehead’s minimization problem much faster (on most inputs) than the classical Whitehead algorithm. The mere fact that these strategies work in practice leads to several interesting mathematical conjectures. In particular, we conjecture that the length of most non-minimal elements in a free group can be reduced...
متن کاملPolynomial Cases for the Vertex Coloring Problem
The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for (P5, dart)-free graphs, (P5, banner)-free graphs, (P5, bull)-free graphs, and (fork, bull)-free graphs.
متن کاملMinimization subproblems and heuristics for an applied clustering problem
A practical problem that requires the classification of a set of points of IRn using a criterion not sensitive to bounded outliers is studied in this paper. A fixed-point (k-means) algorithm is defined that uses an arbitrary distance function. Finite convergence is proved. A robust distance defined by Boente, Fraiman and Yohai is selected for applications. Smooth approximations of this distance...
متن کاملLocal Search Heuristics for NFA State Minimization Problem
In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heuristics, such as stochastic hill climbing and simulated annealing. The description of the proposed methods is given and the results of the numerical experiments are provided.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2017
ISSN: 1571-0653
DOI: 10.1016/j.endm.2017.11.032